Asymptotic methods in queueing theory

On asymptotic accuracy in queueing theory

Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hy...

Editorial - MCQT'10: computational methods and applications in queueing theory

The Madrid Conference on Queueing Theory (MCQT) aims to be a meeting place where scientists and technicians in the field will find a discussion forum to promote research, encourage interaction and exchange ideas. The conference is open to all trends including the development of the theory, methodology advances, computational aspects and applications of Queueing Theory. Papers submitted for this...

Queueing Theory

Queueing Theory

A queue is a waiting line (like customers waiting at a supermarket checkout counter); queueing theory is the mathematical theory of waiting lines. More generally, queueing theory is concerned with the mathematical modeling and analysis of systems that provide service to random demands. A queueing model is an abstract description of such a system. Typically, a queueing model represents (1) the s...

An introduction to queueing theory and matrix-analytic methods